An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs

نویسندگان

  • Xiaoge Zhang
  • Qi Liu
  • Yong Hu
  • Felix T. S. Chan
  • Sankaran Mahadevan
  • Zili Zhang
  • Yong Deng
چکیده

Xiaoge Zhang a,f, Qi Liub,c,g, Yong Hud, Felix T. S. Chane, Sankaran Mahadevanf, Zili Zhanga ,g, Yong Deng a,f* aSchool of Computer and Information Science, Southwest University, Chongqing 400715, China; bDepartment of Biomedical Informatics, Medical Center, Vanderbilt University, Nashiville, 37235, USA; cSchool of Life Sciences and Biotechnology, Shanghai Jiao Tong University, Shanghai, 200030, China; dInstitute of Business Intelligence and Knowledge Discovery, Guangdong University of Foreign Studies, Guangzhou 510006, China; eDepartment of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hum, Kowloon, Hong Kong fSchool of Engineering, Vanderbilt University, Nashiville, 37235, USA g These authors contribute equally *Correspondence and requests for materials should be addressed to Y. D. ([email protected])

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Parallel Shortest Paths in Small Treewidth Digraphs

We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efficiently answered. We give parallel algorithms for the EREW PRAM model of computation that depend on the treewidth of the input graph. When the treewidth is a constant, our algorithms can answer distance queries in O(...

متن کامل

Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms

We consider the problem of preprocessing an n vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be e ciently answered We give parallel algorithms for the EREWPRAMmodel of computation that depend on the treewidth of the input graph When the treewidth is a constant our algorithms can answer distance queries in O n time ...

متن کامل

A Hybrid Routing Algorithm for an Efficient Shortest Path Decision in Network Routing

Recently, shortest path tree construction is essential in network routing. Dijkstra algorithm, one of the static routing algorithms, is widely used. When some links develop new weights, dynamic routing algorithms become more efficient than static routing algorithms. This is because dynamic routing algorithms reduce the redundancy caused by re-computing the affected part of the network in regard...

متن کامل

A Multi-path Hybrid Routing Algorithm in Network Routing

The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...

متن کامل

Computing Tree Decompositions with FlowCutter: PACE 2017 Submission

We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight second place. The algorithm was originally developed in the context of accelerating shortest path computation on road graphs using multilevel partitions. We illustrate how this seemingly unrelated field fits into tree ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 405  شماره 

صفحات  -

تاریخ انتشار 2017